Totally unimodular stochastic programs
نویسندگان
چکیده
We consider totally unimodular (TU) stochastic programs, that is, two-stage stochastic programs whose extensive-form constraint matrix is TU. We generalize the notion of total unimodularity to apply to sets of matrices and provide properties of such sets. We provide several sufficient conditions on stochastic programs to be TU. When solving TU stochastic problems using the L-shaped method, it is not clear whether the integrality restrictions should be imposed on the master problem. Such restrictions will make each master problem more difficult to solve. On the other hand, solving the linear relaxation of the master typically means sending fractional (and unlikely optimal) solutions to the subproblems, perhaps leading to more iterations. Our computational results investigate this trade-off and provide insight into which strategy is preferable.
منابع مشابه
Totally unimodular multistage stochastic programs
We consider totally unimodular multistage stochastic programs, that is, multistage stochastic programs whose extensive-form constraint matrices are totally unimodular. We establish several sufficient conditions and identify examples that have arisen in the literature.
متن کاملA bidirected generalization of network matrices
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the same way as the network matrices do from directed graphs. We develop the necessary theory, give binet representations for interesting sets of matrices, characterize totally unimodular binet matrices and discuss the rec...
متن کاملGeometric Random Edge
We show that a variant of the random-edge pivoting rule results in a strongly polynomial time simplex algorithm for linear programs max{cTx : x ∈ R, Ax 6 b}, whose constraint matrix A satisfies a geometric property introduced by Brunsch and Röglin: The sine of the angle of a row of A to a hyperplane spanned by n− 1 other rows of A is at least δ. This property is a geometric generalization of A ...
متن کاملSolving Totally Unimodular LPs with the Shadow Vertex Algorithm
We show that the shadow vertex simplex algorithm can be used to solve linear programs in strongly polynomial time with respect to the number n of variables, the number m of constraints, and 1/δ, where δ is a parameter that measures the flatness of the vertices of the polyhedron. This extends our recent result that the shadow vertex algorithm finds paths of polynomial length (w.r.t. n, m, and 1/...
متن کاملEnumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices
We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron P(A, 1 ̄ ) = {x ∈ R | Ax ≥ 1 ̄ , x ≥ 0 ̄ }, when A is a totally unimodular matrix. Our algorithm is based on decomposing the hypergraph transversal problem for unimodular hypergraphs using Seymour’s decomposition of totally unimodular matrices, and may be of independent interest.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 138 شماره
صفحات -
تاریخ انتشار 2013